A BPSON Algorithm Applied to DNA Codes Design
نویسندگان
چکیده
منابع مشابه
The Sphere Decoding Algorithm applied to Space-Time Block Codes
The use of digital wireless communication systems has become more and more common during recent years. A multiple-input-multiple-output (MIMO) system using Space-Time Coding techniques can be implemented to enhance the capacity of a wireless link. The optimal decoder is based on the maximum likelihood principle. But as the number of the antennas in the system and the data rates increase, the ma...
متن کاملThe Polynomial Method in Circuit Complexity Applied to Algorithm Design∗
In circuit complexity, the polynomial method is a general approach to proving circuit lower bounds in restricted settings. One shows that functions computed by sufficiently restricted circuits are “correlated” in some way with a low-complexity polynomial, where complexity may be measured by the degree of the polynomial or the number of monomials. Then, results limiting the capabilities of low-c...
متن کاملPerfect Z2Z4-linear codes applied to steganography
Steganography aims to hide secret data imperceptibly into a cover object. We describe a novel method based on Z2Z4-linear codes in which data is embedded by distorting each cover symbol by one unit at most (±1-steganography). This method solves the problem encountered by the most efficient methods known today, concerning the treatment of boundary values. Moreover, a generalization of the produc...
متن کاملFrom Design to Test with UML: Applied to a Roaming Algorithm for Bluetooth Devices
The UML Testing Profile provides support for UML based model-driven testing. This paper introduces a methodology of how to use the testing profile in order to modify and extend an existing UML design model for test issues. As a case study, a new roaming algorithm for bluetooth devices has been develped at the University of Lübeck, is modelled using UML. The usability of the UML Testing Profile ...
متن کاملA Genetic Algorithm Applied to Graph
Many graph problems seek subsets of their vertices that maximize or minimize objective functions on the vertices. Among these are the capacitated p-median problem, the geometric connected dominating set problem, the capacitated k-center problem, and the traveling tourist problem. Prior genetic algorithms research in this area applied a simple mutation of an allele by random replacement. Recentl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2924708